Sub-Tree-Based Approach for Reconfiguration of Light-Tree Pair without Flow Interruption in Sparse Wavelength Converter Network
نویسندگان
چکیده
Network reconfiguration is an important mechanism for network operators to optimize performance and optical flow transfer. It concerns unicast multicast connections. Multicast connections are required meet the bandwidth requirements of applications, such as Internet Protocol-based TeleVision (IPTV), distance learning, telemedicine. In networks, a connection made possible by creation tree-shaped path called light-tree. The problem light-tree pair addressed in this study. Given initial used transfer final that computed operator performance, goal migrate from without interruption. Flow interruption not desirable because it forces them pay financial penalties their customers. To solve problem, existing methods use branch approach inefficient if some nodes do have wavelength conversion capability. Therefore, we proposed study sub-tree-based method. This selects configures sub-tree pairs (initial light-tree, light-tree) be reconfigured. Then, produce sequence configurations. confirms our method efficient solving does cause
منابع مشابه
Tree reconfiguration without lightpath interruption in WDM optical networks
Efficient reconfiguration of optical multicast trees in wavelength division multiplexing (WDM) networks is required. Multimedia applications which consume a huge bandwidth, require multicasting. So, multicast concept is extended to optical networks to improve performance. Today, networks are facing many phenomena such as changes in the traffic model, failures, additions or deletions of some net...
متن کاملRobust Language Pair-Independent Sub-Tree Alignment
Data-driven approaches to machine translation (MT) achieve state-of-the-art results. Many syntax-aware approaches, such as ExampleBased MT and Data-Oriented Translation, make use of tree pairs aligned at sub-sentential level. Obtaining sub-sentential alignments manually is time-consuming and error-prone, and requires expert knowledge of both source and target languages. We propose a novel, lang...
متن کاملTree-based Algorithms for Compressed Sensing with Sparse-Tree Prior
Recent studies have shown that sparse representation can be used effectively as a prior in linear inverse problems. However, in many multiscale bases (e.g. wavelets), signals of interest (e.g. piecewisesmooth signals) not only have few significant coefficients, but also those significant coefficients are well-organized in trees. We propose to exploit this prior, named sparse-tree, for linear in...
متن کاملWavelength Assignment for Light-tree Protection in Wdm Optical Networks
In this paper, we address the wavelength assignment problem for light-tree protection under different traffic models. For static traffic, we formulate the problem mathematically and propose two new heuristics (tabu search and iterated hill-climber) to solve it. For dynamic traffic, in contrast to previous work, we analyze the traffic characteristics and propose a Low Cost First Serve (LCFS) str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2021
ISSN: ['2078-2489']
DOI: https://doi.org/10.3390/info12050211